#include"Sort.h"
int main() {
    int arr1[10] = { 10,9,8,7,6,5,4,3,2,1 };
    SelectSort1(arr1, 10);
    print(arr1, 10);
    int arr2[10] = { 10,9,8,7,6,5,4,3,2,1 };
    SelectSort2(arr2, 10);
    print(arr2, 10); 
    int arr3[10] = { 10,9,8,7,6,5,4,3,2,1 };
    HeapSort(arr3, 10);
    print(arr3, 10);
    int arr4[10] = { 10,9,8,7,6,5,4,3,2,1 };
    BubbleSort(arr4, 10);
    print(arr4, 10);
    int arr5[10] = { 10,9,8,7,6,5,4,3,2,1 };
    QuickSort(arr5, 0,9);
    print(arr5, 10);
    int arr6[10] = { 10,9,8,7,6,5,4,3,2,1 };
    MergeSort(arr6, 10);
    print(arr6, 10);
    int arr7[10] = { 10,9,8,7,6,5,4,3,2,1 };
    MergeSortNonR(arr7, 10);
    print(arr7, 10);
    int arr8[10] = { 10,9,8,7,6,5,4,3,2,1 };
    CountSort(arr8, 10);
    print(arr8, 10);
    return 0;
}